Bistability through Triadic Closure

نویسندگان

  • Peter Grindrod
  • Desmond J. Higham
  • Mark C. Parsons
چکیده

We propose and analyse a class of evolving network models suitable for describing a dynamic topological structure. Applications include telecommunication, on-line social behaviour and information processing in neuroscience. We model the evolving network as a discrete time Markov chain, and study a very general framework where, conditioned on the current state, edges appear or disappear independently at the next timestep. We show how to exploit symmetries in the microscopic, localized rules in order to obtain conjugate classes of random graphs that simplify analysis and calibration of a model. Further, we develop a mean field theory for describing network evolution. For a simple but realistic scenario incorporating the triadic closure effect that has been empirically observed by social scientists (friends of friends tend to become friends), the mean field theory predicts bistable dynamics, and computational results confirm this prediction. We also discuss the calibration issue for a set of real cell phone data, and find support for a stratified model, where individuals are assigned to one of two distinct groups having different within-group and across-group dynamics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lessons from Triadic Supervisors: Maximizing Effectiveness

Through this hermeneutic-phenomenological qualitative study, 10 supervisors of a CACREP accredited program identified emergent themes and challenges of triadic supervision: relationship dynamics, feedback, time management, contextual learning, and matching of supervisees. The researchers offer specific methods to approach these challenges within triadic supervision to maximize effectiveness. Au...

متن کامل

Triadic analysis of affiliation networks

The widely-used notion of triadic closure has been conceptualized and measured in a variety of ways, most famously the clustering coefficient. This paper proposes a measure of triadic closure in affiliation networks designed to control for the influence of bicliques. In order to avoid arbitrariness, the paper introduces a triadic framework for affiliation networks, within which a range of possi...

متن کامل

Uncovering the Formation of Triadic Closure in Social Networks

The triad is one of the most basic human groups in social networks. Understanding factors affecting the formation of triads will help reveal the underlying mechanisms that govern the emergence and evolution of complex social networks. In this paper, we study an interesting problem of decoding triadic closure in social networks. Specifically, for a given closed triad (a group of three people who...

متن کامل

Triadic closure dynamics drives scaling-laws in social multiplex networks

Social networks exhibit scaling laws for several structural characteristics, such as degree distribution, scaling of the attachment kernel and clustering coefficients as a function of node degree. A detailed understanding if and how these scaling laws are inter-related is missing so far, let alone whether they can be understood through a common, dynamical principle. We propose a simple model fo...

متن کامل

A coevolving model based on preferential triadic closure for social media networks

The dynamical origin of complex networks, i.e., the underlying principles governing network evolution, is a crucial issue in network study. In this paper, by carrying out analysis to the temporal data of Flickr and Epinions-two typical social media networks, we found that the dynamical pattern in neighborhood, especially the formation of triadic links, plays a dominant role in the evolution of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Internet Mathematics

دوره 8  شماره 

صفحات  -

تاریخ انتشار 2012